منابع مشابه
Behavioral abstraction is hiding information
We show that for any behavioral Σ-specification B there is an ordinary algebraic specification B̃ over a larger signature, such that a model behaviorally satisfies B iff it satisfies, in the ordinary sense, the Σ-theorems of B̃. The idea is to add machinery for contexts and experiments (sorts, operations and equations), use it, and then hide it. We develop a procedure, called unhiding, which take...
متن کاملInformation Hiding in Parallel Programs Information Hiding in Parallel Programs
ions that together allow these decisions to be isolated and hidden. Virtual topolo-gies, virtual channels, and lightweight processes provide mechanisms for isolating mapping,communication, and scheduling decisions, while port arrays allow these techniques to beapplied to program components that must execute on many processors.In addition to describing the abstractions, we have s...
متن کاملHiding Information via Abstraction (on the Role of Uniform Interpolants in a Development Workspace)
In this paper we analyse some fundamental interconnections between modularisation, (uniform) interpolants and information hiding and we explain how some compatible aspects of these concepts are combined in a notation independent method to establish the existence of a conservative extension J:Espec!Edev of a front-end speciication formalism Espec to a back-end formalism Edev so that Edev accommo...
متن کاملModular Enforcement of Supertype Abstraction and Information Hiding with Client-Side Checking
Static reasoning tools for object-oriented (OO) languages use supertype abstraction, by verifying calls to methods using the specification associated with the receiver’s static type. Unfortunately, contemporary runtime assertion checkers for OO are inconsistent with such static reasoning tools, since they check assertions in an overly-dynamic way on the supplier side. For method calls, such sup...
متن کاملClassifying Components by Behavioral Abstraction
We present an approach for classifying and retrieving reusable software based on exemplary descriptions of its functionality. The functionality of reusable components is described by a set of tuples with each tuple representing a characteristic input-output (or stimulus-response) transformation of the component at hand. With careful choice of these characteristic tuples, information equivalent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.07.027